Parallel and Distributed Scatter-Gather Clustering System Development Proposal
نویسنده
چکیده
From the process of scatter-gather algorithm explained above, we can easily find the essence of the parallel version of this algorithm is the parallel clustering algorithm used in the scatter phase. Frieder, et al. implements a parallel version of the buckshot clustering algorithm [1]. Their work meets the need of the parallel scatter-gather clustering algorithm pretty well, although we can design our own clustering algorithm which is more optimized for our needs.
منابع مشابه
Dynamicity vs. Effectiveness: A User Study of a Clustering Algorithm for Scatter/Gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has linear worst-case time complexity and constant running time average for on-the-fly Scatter/Gather browsing [4]. Our previous experiments showed that when running on a single processor, the LAIR2 on-line clustering algorithm was several hundred times faster than the parallel Buckshot algorithm running on multiple pr...
متن کاملA Fast Online Clustering Algorithm for Scatter/Gather Browsing
We present a fast online clustering algorithm which has linear worst-case time complexity and constant running time average for the well-known online visually oriented browsing modeling called Scatter/Gather browsing (Cutting, Karger, Pedersen, and Tukey 1992). Our experiment shows when running on a single processor, this fast online clustering algorithm is few hundred times faster than the par...
متن کاملScalable Unstructured Mesh Decomposition
As the e ciency of parallel software increases it is becoming common to measure near linear speedup for many applications. For a problem size N on P processors then with software running at O(N=P ) the performance restrictions due to le i/o systems and mesh decomposition running at O(N) become increasingly apparent especially for large P . For distributed memory parallel systems an additional l...
متن کاملAn Eecient Communication Strategy for Finite Element Methods on the Connection Machine Cm-5 System an Eecient Communication Strategy for Finite Element Methods on the Connection Machine Cm-5 System
The objective of this paper is to propose communication procedures suitable for unstructured nite element solvers implemented on distributed-memory parallel computers such as the Connection Machine CM-5 system. First, a data-parallel implementation of the recursive spectral bisection (RSB) algorithm proposed by Pothen et al. is presented. The RSB algorithm is associated with a node renumber-ing...
متن کاملEvaluation of the performance of parallel-hole collimator for high resolution small animal SPECT: A Monte Carlo study
Introduction: Image quality and accuracy of in vivo activity quantification in SPECT are affected by collimator penetration and scatter components, especially in high energy imaging. These phenomena highly depend on the collimator characteristic and photon energy. The presence of penetrated and scattered photons from collimator in SPECT images degrades spatial resolution, contr...
متن کامل